Locality Preserving Load Balancing with Provably Small Overhead

Parallelizing dynamic scientiic applications involves solving the dynamic load balancing problem. The balancing should take the communication requirements of the application into account. Many problems are dealing with objects in k-dimensional space with very special communication patterns. We describe a kind of an orthogonal recursive bisection clustering and show that its dynamic adaption involves only small overhead. As a spatial clustering it is well suited to applications with local communication.